The Explicit Construction of Irreducible Polynomials over Finite Fields

نویسنده

  • Stephen D. Cohen
چکیده

For a finite field GF(q) of odd prime power order q, and n > 1, we construct explicitly a sequence of monic irreducible reciprocal polynomials o f degree n2 m (m = 1, 2, 3 . . . . ) over GF(q). It is the analog for fields of odd order of constructions of Wiedemann and of Meyn over GF(2). We also deduce iterated presenn2** tations of GF(q ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit theorems on generator polynomials

Progress over the past decade is surveyed concerning explicit existence and construction theorems on irreducible, primitive and normal polynomials. © 2005 Elsevier Inc. All rights reserved.

متن کامل

Construction of Irreducible Polynomials over Finite Fields

In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...

متن کامل

On explicit factors of cyclotomic polynomials over finite fields

We study the explicit factorization of 2nr-th cyclotomic polynomials over finite field Fq where q, r are odd with (r, q) = 1. We show that all irreducible factors of 2nr-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of 2n5-th cyclotomic polynomials over finite fields and co...

متن کامل

Iterated constructions of irreducible polynomials over finite fields with linearly independent roots

The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible N-polynomials (with linearly independent roots) over finite fields. For a suitably chosen initial N-polynomial F1ðxÞAF2s 1⁄2x of degree n; polynomials FkðxÞAF2s 1⁄2x of degrees 2 n are constructed by iteration of the transformation of variable x-x þ dx ; where dAF2s and da0: It is shown that the ...

متن کامل

Polynomials over Finite Fields and Applications

Self-reciprocal irreducible monic (srim) polynomials over finite fields have been studied in the past. These polynomials can be studied in the context of quadratic transformation of irreducible polynomials over finite fields. In this talk we present the generalization of some of the results known about srim polynomials to polynomials obtained by quadratic transformation of irreducible polynomia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1992